A note on two generalizations of QF− 3
نویسندگان
چکیده
منابع مشابه
A note on 3-Prime cordial graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کاملGeneralizations of Semiorders: A Review Note
Semiorders may form the simplest class of partially ordered sets that accommodate thresholds of discriminability in binary comparisons. Many other classes of ordered sets that generalize the uniform-threshold feature of semiorders have been studied in recent years. This note describes a variety of generalizations and their interrelationships, including equivalences and proper inclusions between...
متن کاملA Note on Twists of (y^2=x^3+1)
‎‎In the category of Mordell curves (E_D:y^2=x^3+D) with nontrivial torsion groups we find curves of the generic rank two as quadratic twists of (E_1), ‎and of the generic rank at least two and at least three as cubic twists of (E_1). ‎Previous work‎, ‎in the category of Mordell curves with trivial torsion groups‎, ‎has found infinitely many elliptic curves with ...
متن کاملA note on the security of two improved RFID protocols
Recently, Baghery et al. [1, 2] presented some attacks on two RFID protocols, namely Yoon and Jung et al. protocols, and proposed the improved version of them. However, in this note, we show that the improved version of the Jung et al. protocol suffers from desynchronization attack and the improved version of the Yoon's protocol suffers from secret disclosure attack. The succe...
متن کاملa note on 3-prime cordial graphs
let g be a (p, q) graph. let f : v (g) → {1, 2, . . . , k} be a map. for each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of g if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1972
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1972.40.229